Single-machine total completion time scheduling with a time-dependent deterioration

Two agents single machine scheduling problem with total completion time and total weighted completion time objectives

Parallel-machine scheduling with simple linear deterioration to minimize total completion time

We consider the parallel-machine scheduling problem in which the processing time of a job is a simple linear increasing function of its starting time. The objective is to minimize the total completion time. We give a fully polynomial-time approximation scheme (FPTAS) for the case with m identical machines, where m is fixed. This study solves an open problem that has been posed in the literature...

A Hybrid Genetic Algorithm for the Open Shop Scheduling with Makespan and Total Completion Time

Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...

A New Branch-and-Bound for the Problem of Mean Completion Time for the Single Machine with Release Time

Preemptively scheduling a set of independent jobs with release time on one processor is a historical problem. In this paper, the same problem has been considered in which objective is to minimize the mean flow time. To prepare a perfect branch-and-bound, some optimality conditions have been represented and they have been compared with the optimality conditions which have been proposed before. O...

Single Machine Scheduling with Deterioration Effect on Delivery Time ∗

A single machine scheduling problem with delivery time is considered. Job’s delivery time has deterioration effect. For the same processing time model of minimizing different objectives, it is given optimal sequences, respectively. For the same deterioration ratio model, we also give optimal sequences for different objectives. Mathematics Subject Classification: 91A35